Maximum A Posteriori Decoding Algorithms For Turbo Codes
نویسنده
چکیده
The symbol-by-symbol maximum a posteriori (MAP) known also as BCJR algorithm is described. The logarithmic versions of the MAP algorithm, namely, Log-MAP and Max-Log-MAP decoding algorithms along with a new Simplified-Log-MAP algorithm, are presented here. Their bit error rate (BER) performance and computational cornplexity of these algorithms are compared. A new hardware architecture for implementing the MAP-based decoding algorithms suitable for chip design is also presented here.
منابع مشابه
Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes
In this article, we present two versions of a simplified maximum a posteriori decoding algorithm. The algorithms work in a sliding window form, like the Viterbi algorithm, and can thus be used to decode continuously transmitted sequences obtained by parallel concatenated codes, without requiring code trellis termination. A heuristic explanation is also given of how to embed the maximum a poster...
متن کاملPerformance Comparison of Turbo Decoding Algorithms
Turbo coding is the most commonly used error correcting scheme in wireless systems resulting in maximum coding gain. In this paper, a comparative study of the symbol-bysymbol maximum a posteriori (MAP) algorithm, its logarithmic versions, namely, Log-MAP and Max-Log-MAP decoding algorithms used in SISO Turbo Decoders are analyzed. The performance of Turbo coding algorithms are carried out in te...
متن کاملAbout Symmetric Convolutional Codes of Memory Two and Three Used in Space-time Turbo Coding
In this paper are analysed the performances of different symmetric convolutional turbo codes for a transmission system that uses a doubly iterative decoding algorithm, with multiple antenna diversity. The turbo encoder uses an '–QPP (Quadratic–Permutation–Polynomial) interleaver, and two different decoding algorithms, namely, the Max–Log–APP (Maximum– Logarithm–A–Posteriori–Probability) algori...
متن کاملIterative Decoding Algorithms for Turbo Product Codes
In this paper we introduce the iterative decoding principle, “the turbo principle”, for the bidimensional Turbo Product Codes (TPC’s). The constituent codes used for encoding on rows and columns are two concatenated (7,4) Hamming block codes. Several Soft Input Soft Output (SISO) algorithms can be used for the iterative decoding process. At each iteration, the two decoders decode all rows, then...
متن کاملAn Efficient SISO Algorithm for Reed-Solomon Codes
There has been renewed interest in iterative decoding algorithms for concatenated codes since the introduction of Turbo codes. Such iterative methods are built on top of soft-insoft-out algorithms. Powerful concatenated codes may be constructed with linear block codes codes as constituent codes. Such codes can be better alternatives to Turbo Codes either when high coding rates or when short int...
متن کامل